A Strategy-Proof and Non-monetary Admission Control Mechanism for Wireless Access Networks

We study admission control mechanisms for wireless access networks where (i) each user has a minimum service requirement, (ii) the capacity of the access network is limited, (iii) the access point is not allowed to use monetary mechanisms to guarantee that users do not lie when disclosing their minimum service requirements, and (iv) the access point wants to admit as many users as possible. To guarantee truthfulness, we use auction theory to design a mechanism where users compete to be admitted into the network. We propose admission control mechanisms under which the access point intelligently allocates resources based on the announced minimum service requirements to ensure that users have no incentive to lie and the capacity constraint is fulfilled. We also prove some properties that any feasible mechanism should have. Index Terms Auctions, truth-telling, admission control, resource allocation